Probabilistic analysis of block Wiedemann for leading invariant factors

We determine the probability, structure dependent, that block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for independent. show, using size slightly larger than r, r factors are computed with high probability over any field. Moreover, an is provided compute given matrix and thus select needed obtain desired probability. The worst case improved, post hoc, by incorporating partial information about